Bid Increment Adjusting Strategies in English Auction-based Sponsored Search
نویسندگان
چکیده
English auctions are applied in many current e-commerce applications because of the easy implementation. Some sponsored search advertising (SSA) services consider the ascending bidding rules of English auctions to determine winners. However, the high computation cost of determining winners is the major drawback of the English auction-based SSAs. Because the SSA is an online service, Internet users do not wait for a long time to receive the search result pages. In this paper, we provide a mechanism to reduce the overhead of computing winners and maximize the revenue obtained by the search engine provider (SEP). Our proposed mechanism adopts the minimum increase price (MIP), which is similar to the central price in the English auction, to indicate how much should be raised for the bids with updated prices. We design a uniform MIP adjusting strategy and an adaptive MIP adjusting strategy to determine the MIP setting in each round. We analyze the convergent speed of two proposed MIP adjusting strategies. According to our simulation results, we conclude the following properties. For all the SEP revenue considerations, the adaptive MIP adjusting strategy is outstanding in popular keywords, and rare keywords for the uniform MIP adjusting strategy. Opposite results are obtained for the convergent speed.
منابع مشابه
An Optimal Auction Infrastructure Design: An Agent-based Simulation Approach
This paper presents an agent-based simulation approach to estimate the effects of auction parameters on the auction outcomes, and to find an optimal or, at least, close to an optimal infrastructure. In particular, this study intends to study how bidders’ personalities and bidding strategies with other auction parameters affect the closing prices in two auction mechanisms: English and Yankee auc...
متن کاملPutting Auction Theory to Work: Ascending Auctions with Package Bidding
Ascending auctions with package bidding and their economic uses are explained and the main results of recent FCC-sponsored experiments with such auctions are summarized. A benchmark model is formulated that accounts for the experimental results. In the benchmark, if each bidder bids “straightforwardly” at each round for its potentially most profitable package, then the total payoff is approxima...
متن کاملDivision of the Humanities and Social Sciences California Institute of Technology Pasadena, California 91125 to Score or Not to Score? Estimates of a Sponsored Search Auction Model
We estimate a structural model of a sponsored search auction model. To accommodate the “position paradox”, we relax the assumption of decreasing click volumes with position ranks, which is often assumed in the literature. Using data from “Website X”, one of the largest online marketplaces in China, we find that merchants of different qualities adopt different bidding strategies: high quality me...
متن کاملDeep Reinforcement Learning for Sponsored Search Real-time Bidding
Bidding optimization is one of the most critical problems in online advertising. Sponsored search (SS) auction, due to the randomness of user query behavior and platform nature, usually adopts keyword-level bidding strategies. In contrast, the display advertising (DA), as a relatively simpler scenario for auction, has taken advantage of real-time bidding (RTB) to boost the performance for adver...
متن کاملLearning Environmental Parameters for the Design of Optimal English Auctions with Discrete Bid Levels
In this paper we consider the optimal design of English auctions with discrete bid levels. Such auctions are widely used in online internet settings and our aim is to automate their configuration in order that they generate the maximum revenue for the auctioneer. Specifically, we address the problem of estimating the values of the parameters necessary to perform this optimal auction design by o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013